Optimal task allocation in hypercube multiprocessor ensembles
نویسندگان
چکیده
منابع مشابه
Task Allocation onto a Hypercube
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...
متن کاملTask Allocation onto a Hypercube by Recursive
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...
متن کاملOptimal Combinatorial Functions Comparing Multiprocess Allocation Performance in Multiprocessor Systems
For the execution of an arbitrary parallel program P , consisting of a set of processes, we consider two alternative multiprocessors. The rst multiprocessor has q processors and allocates parallel programs dynamically, i.e. processes may be reallocated from one processor to another. The second employs cluster allocation with k clusters and u processors in each cluster here processes may be real...
متن کاملTask Allocation and Scheduling of Concurrent Applications to Multiprocessor Systems
Task Allocation and Scheduling of Concurrent Applications to Multiprocessor Systems by Kaushik Ravindran Doctor of Philosophy in Engineering Electrical Engineering and Computer Sciences University of California, Berkeley Professor Kurt Keutzer, Chair Programmable multiprocessors are increasingly popular platforms for high performance embedded applications. An important step in deploying applica...
متن کاملAutomated Task Allocation on Single Chip, Hardware Multithreaded, Multiprocessor Systems
The mapping of application functionality onto multiple multithreaded processing elements of a high performance embedded system is currently a slow and arduous task for application developers. Previous attempts at automation have either ignored hardware support for multithreading and focused on scheduling, or have overlooked the architectural peculiarities of these systems. This work attempts to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1993
ISSN: 0898-1221
DOI: 10.1016/0898-1221(93)90055-z